Sequential Structure Suffices to Solve Nativist Puzzles

نویسنده

  • Rens Bod
چکیده

The debate between hierarchical versus sequential structure in language acquisition has recently flared up again (cf. Frank, Bod & Christiansen 2012; Pesetsky 2013). Roughly, the nativist view on language endorses that human language acquisition is guided by innate rules that operate on hierarchical structures. The empiricist view assumes that language acquisition is the product of abstractions from empirical input but leaves it as an open question whether sequential or hierarchical structure is needed. Some empirical models use sequential structure (e.g. Reali & Christiansen 2005) while other models are based on hierarchical structure (Bod 2009; Bod & Smets 2012). Much work in empirical language acquisition has focused on a relatively small set of phenomena such as auxiliary fronting. For example, Reali & Christiansen (2005) argued that auxiliary fronting could be learned by linear models based on sequential structure, though Kam et al. (2008) showed that the success of these models depend on accidental English facts. Other empiricist approaches have taken the notion of structural dependency together with a combination operation as minimal requirements (e.g. Bod 2009), which overcomes the problems raised by Kam et al. (2008). In Bod and Smets (2012) it was shown that a much larger set of phenomena can be learned by an empiricist computational model. These phenomena are well-known in the generativist literature (Ross 1967; Adger 2003) and are related to wh-questions, relative clause formation, topicalization, extraposition and left dislocation. It turned out that these hard cases can be learned by an unsupervised tree-substitution grammar induction algorithm that returns the sentence with the best-ranked derivation for a particular phenomenon, using only a very small fraction of the input a child receives. However, Bod and Smets (2012) also observed that these nativist cases were learned by using relatively shallow structures with little or no hierarchy. This raised the question as to how much structure is actually needed to learn these syntactic constraints. In the current paper, we present a very simple model that reduces all syntactic structuring to concatenations of substrings without any hierarchy. We show that almost all results obtained by the hierarchical grammar in Bod & Smets (2012) can also be learned by means of a sequential grammar using substringconcatenation only. It should be stressed that the essence of the debate between nativism and empiricism lies often in the relative contribution of prior knowledge and linguistic experience (cf. Lidz et al. 2003; Ambridge & Lieven 2011; Clark and Lappin 2011). Following the nativist view, the linguistic evidence is so hopelessly underdetermined that innate components are necessary. This Argument from the Poverty of the Stimulus can be phrased as follows (see Pullum & Scholz 2002 for a detailed discussion):

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sudoku as a SAT Problem

Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This paper addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding and...

متن کامل

Indications of de Sitter spacetime from classical sequential growth dynamics of causal sets

A large class of the dynamical laws for causal sets described by a classical process of sequential growth yields a cyclic universe, whose cycles of expansion and contraction are punctuated by single ‘‘origin elements’’ of the causal set. We present evidence that the effective dynamics of the immediate future of one of these origin elements, within the context of the sequential growth dynamics, ...

متن کامل

A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles: Final Report

For this project, I implemented the genetic algorithm-based jigsaw puzzle solver described in “A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles” by Sholomon et al [1]. This method involves producing a “child” solution from two “parent” solutions by detecting, extracting, and combining correctly assembled puzzle pieces. The solver developed by the paper’s team is able to accurately...

متن کامل

Solving Sudoku Puzzles Based on Customized Information Entropy

Conception and calculation method of information entropy is customized for Sudoku puzzles and a corresponding algorithm is designed to solve Sudoku puzzles. The definitions of inverse information entropy and information amount for inverse information entropy are also introduced and directly used instead of information entropy in order to simplify the solving procedure. Experimental results show...

متن کامل

Building blocks: A novel metaphor for solving 3D puzzles

This paper presents our team’s design and implemention of an innovative solution to solve the challenge proposed by the 3DUI Contest, which consisted of creating a 3DUI to solve simple 3D puzzles. Rather than using a direct manipulation technique to handle placement of the puzzle pieces, such as the virtual hand, we designed an innovative technique based on build. We aimed to provide a fun and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013